Network Sparsification with Guaranteed Systemic Performance Measures
نویسندگان
چکیده
منابع مشابه
Abstraction of Linear Consensus Networks with Guaranteed Systemic Performance Measures
ion of Linear Consensus Networks with Guaranteed Systemic Performance Measures Milad Siami and Nader Motee⋆ Abstract—A proper abstraction of a large-scale linear consensus network with a dense coupling graph is one whose number of coupling links is proportional to its number of subsystems and its performance is comparable to the original network. Optimal design problems for an abstracted networ...
متن کاملOptimization of performance measures in Doroodzan Irrigation Network
Abstract- In this research, the performance measures of water equity and productivity have been optimizedin the entire DoroodzanIrrigation Network by using genetic algorithms. Results indicated thatirrigation water management improvement at field scale[increasing irrigation application efficiency (Ea) and water reduction fraction (WRF)] has much more impressive impact on raising the performance...
متن کاملCommunity-aware network sparsification
Network sparsification aims to reduce the number of edges of a network while maintaining its structural properties: shortest paths, cuts, spectral measures, or network modularity. Sparsification has multiple applications, such as, speeding up graph-mining algorithms, graph visualization, as well as identifying the important network edges. In this paper, we consider a novel formulation of the ne...
متن کاملImpact Case Study: Guaranteed Performance on Controller Area Network (CAN)
Controller Area Network (CAN) is a digital communications bus used by the automotive industry for invehicle networks. Research from the Real-Time Systems Group at the University of York introduced techniques that enable CAN to operate under high loads (approx. 80% utilisation) while ensuring that all messages meet their deadlines. The research led directly to the development of commercial produ...
متن کاملEnhancing Guaranteed Delays with Network Coding
For networks providing QoS guarantees, this paper determines and evaluates the worst case end-to-end delays for strategies based on network coding and multiplexing. It is shown that the end-to-end delay does not depend on the same parameters with the two strategies. This result can be explained by the fact that network coding can cope with congestions better than classical routing because it pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2015
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2015.10.338